搜索资源列表
PLDistance
- 已知三维点和三维线的坐标和代表式，求两者间最短距离，用对话框实现，可以提出算法函数单独使用-known three-dimensional and three-dimensional point of the line-coordinates and representatives, for the shortest distance between the two, with dialog to achieve, we can make use of arithmetic functions
最短距离问题
- 求解网络中的最短路径。假设某个计算机网络有n个站点，依次编号为1,2,…,n；有的站点之间有直接的线路连接（即这两个站点之间没有其它站点），有的站点之间没有直接的线路连接。如果用三元组（i,j,f）来表示该网络中的站点I和站点j之间有直接的线路连接且它们之间的距离为f 当已知该网络各站点之间的直接连接情况由m个三元组（i1,j1,f1）,(i2,j2,f2),…,(im,jm,fm)确定时，要求计算出对于网络中任意一个站点g(1≤g≤n)到其余各站点的最短距离。-the shortest pat
untitled
- 求任意一点到任意点的距离的最小值！ 对于求解一些最短距离的问题可以提供一些帮助！-seek any point to any point of the minimum distance! For some of the shortest distance to solve the problem, it can provide some help!
FastMarching_version1
- The function MSFM2D/MSFM3D calculates the shortest distance from a list of points to all other pixels in an 2D or 3D image, using the Multistencil Fast Marching Method (MSFM). This method gives more accurate distances by using second order derivative
distance
- 求两点间最近路径，以地图为例。查找两地间最短路径。-shortest distance
MinDistTest
- 一个查找带权拓扑图中，任意两点最短距离的算法函数，函数名为MinDis，开发环境是vc6.0，界面和工程只是举了个例子，测试下10个节点中任意两个节点查找最短路径。 -Find the right one with a topology, the shortest distance between any two points in the algorithm function, the function is named MinDis, the development environmen
shortest
- shortest distance routing algorithm
the-shortest-path
- 在VC 环境下用算法求出最短距离，该算法克服了以往算法的缺点-VC environment in the shortest distance calculated by algorithm
shortest-
- 在VC 环境下用算法求出最短距离，该算法克服了以往算法的缺点-VC environment in the shortest distance calculated by algorithm
shortest-distance
- 数据结构中的经典算法。用迪杰斯特拉算法求有向网的源点到其余各顶点的最短距离。-The classical algorithm data structure. Dijkstra algorithm is used to find a source network to the rest of the vertices of the shortest distance.
Distance-of-two-points
- 为了计算两点之间的距离，同时也是为了计算两点之间的最短距离，所以用这个代码很方便。-To calculate the distance between two points, but also to calculate the shortest distance between two points, so use this code is very convenient.
Identify-the-distance-holes1
- 小孔识别计算最短距离，识别两幅图中那副图中有孔，并且计算出图中物体最短处的距离-Identify the shortest distance holes, identify the figure askew two figures have holes, and the objects in the diagram to calculate the shortest distance at
Identify-the-distance-holes2
- 采用VC++完成的小孔的识别和带小孔的物体的最短处的距离计算-Using VC++ to complete the identification of holes and objects with holes at the shortest distance calculation
The-shortest-path-bellman-ford
- 在实际问题中，边的权值一般以正权的形式出现，但是很多情况下负权也是存在的。这个时候，最短路径不一定存在。我们无法得到像dijkstra算法那样时间复杂度较低的算法，但是，仍然可以用bellman-ford迭代算法去解决问题。 bellman-ford算法是迭代算法，它不像dijkstra算法，按照一定的顺序直接算出每个点的距离值，而是不断地修改每个点的当前最小距离值，直到求出真正的最短距离为止。 -In practical problems, the edge weight is gen
short-distance
- 求一个复杂网络的平均最短距离，一般平均最短距离越小，网络的效率越高。-obtain the average shortest distance of network
the-shortest-way
- 求图中由用户指定的开始点与目标点的最短路径并将路径节点和长度进行输出-calculate the shortest distance between the start and the end
distance-vector
- 计算机网络实验，实现距离向量路由算法，输入网络拓扑图中节点个数及边，模拟信息收发，动态更新出最短距离矩阵-Computer network experiment, distance vector routing algorithm, the input network topology diagram node number and edge, analog messaging, dynamic update the shortest distance matrix
finding-the-shortest
- 结合图论的知识并用C++语法知识实现的解决各个城市之间最短距离问题，它很好地结合了找出图上任意两个点之间最短距离及路线的Dijstra 算法。-we combine the technology of the map with the knowledge of C++ to find the shortest distance of the two spots.It perfectly take the advantage of the algorithm of Dijstra,which is
the-short-distance-genetic-matlab
- 最短距离问题，利用遗传算法解决。这是一个完整的数模题目，有题目，思路，解决方法及源代码，希望大家能够喜欢-The shortest distance problem, the use of genetic algorithms to solve. This is a complete digital-analog problem, there are questions, ideas, solutions and source code, I hope everyone can enjoy
Latitude and longitude calculation distance
- 已知经纬度计算两点之间的距离 并筛选出所有距离中的最短距离(use the longitude and latitude to calculate the distance between two points and find the shortest distance from all distances.)